Predictive management of a network buffer

ABSTRACT

Predictive management of a network buffer is contemplated. The network buffer maybe predictively managed to control packet drop based at least in part on predicted sojourn time. The predicted sojourn time may be determined to predict time needed from an arriving packet to travel through a queue of the network buffer.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. provisional Application No. 61/756,641 filed Jan. 25, 2013, the disclosure of which is incorporated in its entirety by reference herein.

TECHNICAL FIELD

The present invention relates to managing network buffers, such as but not necessarily limited to network buffers, elements or other devices configured to temporarily queue packets or other data constructs prior to being subsequently communicated.

BACKGROUND

Buffering can be employed with network elements to minimize packet loss and to maintain efficient use of an egress link when an ingress link(s) supports a higher aggregate data rate than the egress link. Transmission Control Protocol (TCP) algorithms utilize congestion control algorithms that are “loss-based” in that they increase their transmission rate until they experience packet loss. In many network elements, packet loss is the result of buffer overflow, and (if the buffer is sufficiently sized) the result is that TCP effectively adjusts its average transmit rate to match the rate of the bottleneck link. However, another result of this approach is that the buffer at the head of the bottleneck link is kept nearly full during the course of the TCP connection. This nearly-full buffer creates a couple of problems for network performance. If the buffer is oversized relative to the bandwidth-delay product (BDP) of the egress link, which may be defined as the product of the data rate of the egress link and the expected average round-trip time for the TCP connections that will utilize it, then the latency created by this nearly-full buffer will have a significant, negative impact on the performance of interactive and latency sensitive traffic, such as web browsing, VoIP, video chat, etc. On the other hand, if the buffer is undersized relative to the BDP, then TCP performance may suffer, and the nearly-full buffer may not have sufficient space to handle traffic bursts, and may result in excessive packet loss and poor performance for new connections.

FIGS. 1-3 illustrate buffer occupancy diagrams where the buffer is oversized (FIG. 1), proportional (FIG. 2) and undersized (FIG. 3) relative to the BDP of a corresponding egress link. The graphs illustrate implementation of one type of TCP congestion control where a source automatically decreases packet transmission rates in response to determining a dropped packet and thereafter increases packet transmission rates in a linear fashion until determining a subsequently dropped packet. The packet drop is shown to occur for exemplary non-limiting purposes due to the buffer becoming overloaded and being unable to store a received packet where each corresponding packet drop is represented along the horizontal access with a value of “0”. A saw-tooth pattern illustrates a percent occupancy of the buffer resulting from the source decreasing and then increasing packet transmission rates as a result of failing to receive a corresponding acknowledgement (acknowledgements may be sent on a per-packet basis or on a per-window basis (multiple packets)). A link utilization overlay illustrates corresponding usage of the egress link where a value of “0” indicates zero or under utilization and a value of “1” indicates full or desired utilization (the link may continue to be utilized while the source decreases packet transmission rates as queued packets are dequeued). The buffer occupancy should vary between 0% and 100% utilization when properly sized in order to avoid a standing queue (undesirable latency—see FIG. 1) and a buffer underrun (absence of packets to transmit resulting in a link idle (“0” link value)—see FIG. 3).

FIG. 4 illustrates a buffer occupancy diagram similar to those described above when control delay (CoDel) active queue management (AQM) is implemented with an oversized buffer. For purposes of illustration, FIG. 4 shows an initial portion in which the CoDel AQM is not active, and the buffer occupancy proceeds in a manner identical to FIG. 1, followed by a subsequent portion in which the CoDel AQM is active. In the subsequent portion, the CoDel AQM instigates packet drops, e.g., prior to buffer overflow, in order to prompt the source to decrease and then increase packet transmission rates using TCP congestion control, and thus reduce or eliminate the standing queue. The subsequent, CoDel AQM portion may begin to compensate for the TCP congestion control failing to compensate for the oversized buffer (standing queue) by controlling the buffer to drop packets when being dequeued (head drop), i.e., to prevent subsequent transport of the packet over the egress link. The buffer may be controlled to head drop packets in order to engage the TCP congestion control capabilities of the source, i.e., to cause the source to decrease and then increase packet transmission rates such that buffer occupancy varies according to the illustrated saw-tooth pattern. Optionally, the CoDel AQM portion may perform other operations besides head drops, such as by including information in the header of transmitted packets to prompt similar actions from the source (e.g. Explicit Congestion Notification (ECN) marking). For non-limiting purposes, the “drops” described herein are intended to include this or similar non-drop related activities sufficient to engage the TCP congestion control capabilities of the source.

The CoDel AQM related operations, which are shown to correspond with the subsequent portion in FIG. 4, require the buffer to add a timestamp or other time marker to packets traversing therethrough, which can be a complex and problematic process. One non-limiting aspect of the present invention contemplates facilitating operations similar to CoDel AQM, i.e., utilizing buffer-based or buffer-originating packet drops, such as but not necessarily limited to drops occurring prior to overload, to facilitate engaging TCP congestion control or other related control capabilities of a source.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1-4 illustrate buffer occupancy diagrams.

FIG. 5 illustrates a predictively managed system as contemplated by one non-limiting aspect of the present invention.

FIG. 6 illustrates a predictively managed network element in accordance with one non-limiting aspect of the present invention.

FIG. 7 illustrates a flowchart of a method for predictively managing a network buffer in accordance with one non-limiting aspect of the present invention.

DETAILED DESCRIPTION

As required, detailed embodiments of the present invention are disclosed herein; however, it is to be understood that the disclosed embodiments are merely exemplary of the invention that may be embodied in various and alternative forms. The figures are not necessarily to scale; some features may be exaggerated or minimized to show details of particular components. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a representative basis for teaching one skilled in the art to variously employ the present invention.

FIG. 5 illustrates a predictively managed system 10 in accordance with one non-limiting aspect of the present invention. The system 10 illustrates a plurality of network elements 12, 14, 16, 18, 20, 22 configured to facilitate exchanging signaling between themselves and/or devices (not shown) connected thereto or otherwise in communication therewith. One non-limiting aspect of the present invention relates to predictively managing buffering operations associated with one or more of the network elements 12, 14, 16, 18, 20, 22. The managed buffering operations are intended to encompass various processes and/or resources of the network elements utilized to facilitate packet transmissions. The term “buffering” has merely been selected to comply with nomenclature commonly used by one skilled in the art when referencing operations performed when devices facilitate exchanging packets according to the requirements of the Transmission Control Protocol (TCP). While TCP is predominantly described, the present invention is not necessarily so limited and fully contemplates its use and application with other packet control and/or delivery protocols, such as but not necessarily limited to User Datagram Protocol (UDP).

The system 10 illustrates a first connection 24 being used to facilitate a file transfer and a second connection 26 being used to facilitate a voice over Internet protocol (VoIP) phone call. The first connection 24 may be established according to TCP to facilitate exchanging packets between the first and fourth network elements, and the second connection 26 may be established according to UDP to facilitate exchanging packets between the fifth and sixth network elements 20, 22. The first and second connections 24, 26 are shown to be made based at least in part on communications exchange through second and third network elements. One or more links (double arrowed lines) may facilitate transmitting signaling between each of the network elements 12, 14, 16, 18, 20, 22 to enable communicating the packets associated with the first and second connections 24, 26. The links may correspond with any type of wired and/or wireless networks having capabilities sufficient to facilitate signaling sufficient for carrying packets between corresponding network elements. First, second, third and fourth links are shown to facilitate communicating packets at one gigabit per second (1 Gbps) and a fifth link is shown to facilitate commuting packets at 20 megabit per second (20 Mbps). The illustrated data rates are shown for exemplary, non-limiting purposes to demonstrate one aspect of the present invention with respect to managing buffering operations of a bottlenecked or other network element having link speeds slower than other links associated with the related connection, e.g., the second network element 14. While FIG. 5 illustrates a limited number of network elements (six) and a single bottlenecked network link (the fifth link), any number of additional network elements and links may be utilized to facilitate the connections 24, 26 and/or require the contemplated predictive management of buffering operations.

FIG. 5 illustrates a scenario where packet delay or time taken to facilitate delivering packets from a source to a destination, interchangeably referred to herein as packet latency, may be more relevant to one type of connection than another type of connection. Packet latency, for example, may be less relevant to the first connection 24 than the second connection 26 due to the file transfer being more tolerant of packet latency and the VoIP calls or other similarly sensitive transmissions being more intolerant of packet latency, e.g., web browsing, video chat, etc. may experience service interruption if packet latency becomes noticeable. One non-limiting aspect of the present invention contemplates distinguishing the type of traffic traveling through the connections 24, 26 and facilitating the contemplated predictive buffering based at least in part thereon, e.g., buffering may be predictively controlled to allow more latency for file transfers than for VoIP calls. Of course, it may be desirable in many situations to limit packet latency, limit standing queues or otherwise control packet transmissions such that the predictive buffering processes contemplated herein may be beneficial in facilitating buffering for any type of traffic without assessing the type of traffic being buffered.

FIG. 6 illustrates a predictively managed network element 40 in accordance with one non-limiting aspect of the present invention. The network element 40 may correspond with the second network element 14 shown in FIG. 5 or any one of a plurality of network elements 12, 14, 16, 18, 20, 22 employed as a hop between a source and a destination endeavoring to transfer packets over a particular connection 24, 26, such as but not necessarily limited to a TCP connection. As network elements 40 (Ethernet switches, routers, modems, access points, etc.) may have varying configurations, sizes and operational capabilities, the basic operational capabilities common to many network elements are illustrated to include an input 42, an output 44, a buffer 46 and a queue 48. A controller 50 configured in accordance with the present invention to predictively manage buffering is shown to be associated with the network element 40, such as by being physically resident on the network element 40 or as a remote or standalone device having capabilities sufficient to facilitate transmitting commands or otherwise controlling buffering and/or other operations of the network element 40 associated with the predictive buffer management contemplated herein.

The controller 50 may include a plurality of instructions stored on a non-transitory computer-readable medium, which may be operable with a processor, to facilitate predictively managing buffering operations of the network element 40. The controller 50 may be configured to assess a size or capacity of the buffer 46 and to facilitate managing the amount of that capacity used to facilitate queuing packets according to the processes contemplated herein. The queue 48 may correspond with an amount of the buffer 46 capacity actually being used to queue packets for subsequent transmission from the output 44 as a part of a dequeuing processing, which is shown for exemplary purposes to comprise approximately 75% of the buffer 46 but may be more or less than that depend on desired and/or selectable operating conditions. The dequeuing process is predominately described herein with respect to delivering a packet from the queue 48 to a link associated with the output 44 but may also include a head drop process where a packet is dropped prior to being output to the link for transmission. As described below in more detail, the number of bytes or number of packets within the queue 48 at any one time may be controlled according to a drop decision function (ƒ_(d)) where queue size is managed by dropping packets as part of an enqueuing process, referred to as a tail drop.

The dropping of packets as part of the enqueuing process may be more beneficial than dropping packets as part of the dequeuing process as it may alleviate the processing demands and resource consumptions associated with facilitating progression of a packet through an entire length of the queue 48 before being dropped. Furthermore, during the enqueuing process, the network element 50 may already perform multiple operations (such as administrative packet forward/drop decisions) to which the described packet dropping function could be added. Network elements typically do not perform such operations during the dequeuing process, and as a result the dequeuing process may be implemented in a highly optimized way that does not lend itself to the addition of packet dropping functions. The predictive management contemplated by one non-limiting aspect of the present invention may be characterized by tail dropping packets while being enqueued, i.e., before a packet is delivered to the queue 48 for subsequent dequeuing.

FIG. 6 illustrates an exemplary configuration where five packets (P₁, P₂, P₃, P₄, P₅) have been enqueued and a sixth packet (P₆) is in the process of being enqueued. The controller 50 may be configured to predictively manage the buffer 46 in accordance with the present invention by deciding whether to drop or not drop the incoming sixth packet, and subsequent packets, according to the drop decision function. The drop decision function may analyze a sojourn time ({tilde over (D)}₆) representative of an amount of time predicted for the sixth packet to travel through the queue 48. The sojourn time may be calculated based on a ratio of bytes currently in the queue (B(t)) and an estimated egress rate ({tilde over (R)}(t)) to predict travel time through the queue 48 before the sixth packet actually travels through the queue. In this manner, the predictive drop decision may be based on an estimated rate at which the packets already in the queue will be dequeued as a result of the expected link performance, and beneficially without having to timestamp or actually measure an amount of time taken for the sixth packet or any other packet to travel through the buffer/queue 46, 48.

The sojourn time, and thereby the drop decision, is shown to be at least partially dependent on an egress rate of the link expected to carry the sixth packet. The packets may transition through the queue 48 according to a first-in-first-out process such that the packets move sequentially from an input side of the queue to an output side of the queue before finally being dequeued. As the data rate or performance of the egress link may vary due to any number of network variables, the estimated egress rate may be used instead of a current or currently measured egress rate (R(t)). The estimated egress rate may be determined according to a rate estimation function (ƒ_(R)) where prior egress rates may be factored to represent historical performance of the egress link over a selectable period of time, e.g., by averaging egress rates for a certain number of preceding packet transmissions, using a smoothed (IIR) estimate of the egress rate during intervals when the queue is busy or, in the case where the egress rate is controlled by the network element itself using token bucket rate shaping parameters, the configuration and state of the token bucket rate shaper. The rate estimation function may be coupled with the sojourn time to facilitate the drop or not drop decision of the drop decision function. As shown, the sixth packet may be thereby dropped before entering the queue 48 (d₆ shown with a value of “1”) or not dropped and allowed to enter the queue 48 (d₆ shown with a value of “0”).

The drop decision function may include assessing the sojourn time or other predicted measure of travel relative to a corresponding threshold, which is described in one non-limiting aspect of the present invention as being a sojourn threshold. The sojourn threshold may be calculated by the drop decision function according to any number of variable and desired operating characteristics of the buffer, the egress link and/or other influences, such as round trip time (RTT), etc. The sojourn threshold, for example, may be set to 5 ms or other time value believed to be beneficial in balancing the need for dropping packets, thereby instigating TCP congestion control capabilities of a source of the packet, versus a need to achieve desired link utilization levels. Optionally, the drop decision function may include additional steps and/or processes when deciding whether to drop or not drop a packet in addition requiring the sojourn threshold to be surpassed. One such addition may relate to entering a drop state or pending state where the sixth packet and/or some number of packets exceeding the threshold are not immediately dropped and instead are monitored for a period of time to insure the sojourn threshold is surpassed for a sufficient period before dropping actually commences

One non-limiting aspect of the present invention contemplates implementing the drop decision function by leveraging use of the CoDel AQM process for making head-drop decisions, but instead of making head drops, the drop decision function may employ the same logic for making tail drops (dropping before entering queue 48). This may include using predicted sojourn time instead of measured sojourn time, optionally on a per-packet basis for each packet, and comparing the predicted sojourn time to a threshold (e.g. 5 ms). If the predicted sojourn time remains below threshold, or drops below the threshold at least once every interval (e.g. 100 ms), the drop decision function does not trigger any packet drops. If the predicted sojourn time exceeds the threshold, and remains above threshold for an interval (100 ms), the drop decision function enters the drop-state. Upon entering the drop-state, the drop decision function triggers a single packet drop. As long as the predicted sojourn time remains above threshold, the drop decision function remains in the drop-state and will trigger further packet drops at a rate that increases with time. For example, the time interval between triggered packet drops may progress according to 1/(interval*sqrt(N)), where interval is 100 ms, sqrt( ) is the square-root function, and N is the count of packet drops during this drop-state period. Once the predicted sojourn time falls below threshold, the drop decision function exits the drop-state, and packet drops cease. If the drop decision function re-enters the drop-state shortly after having exited the drop-state, the count of packet drops is not reset to 1, but instead is decremented slightly (e.g. by 2) from its final value on the previous drop-state period.

One non-limiting aspect of the present invention contemplates implementing the drop decision function according to fuzzy logic, thereby enabling management the queue using a fuzzy logic algorithm to control TCP flows via adjusting the packet drop rate in response to changes in queuing latency. The packet drop rate is predominantly described with respect to dropping packets prior to being enqueued (tail drop), however, the present invention is not necessarily so limited and fully contemplates the fuzzy logic algorithm being utilized to facilitate head dropping packets. In the case of head dropping packets, certain parameters may be calculated based on actual values instead of the predictions, e.g., actual sojourn time generated by time stamping packets may be utilized instead of the predictive/estimated sojourn time described above. The network element may be used to monitor per-packet queuing latency as a metric to evaluate congestion, and packet drops (or potentially ECN markings) to control the rate of the TCP connections that traverse the device. The drop decision function may use a fuzzy logic controller that processes inputs relating to the queuing latency (such as the current queuing latency, the recent history of queuing latency, the rate of change in queuing latency, the amount of time that queuing latency has remained above a certain threshold, etc.) to produce an output in the form of a drop probability (or drop rate) that is used to determine which packets will be forwarded, and which will be dropped (or ECN marked).

The long-term-average rate for a single steady-state TCP session may be approximately inversely proportional to the square root of the drop probability (but also dependent on the packet size and round-trip time for the connection). However, the network element may in general be supporting a constantly varying number of TCP connections in various states of their congestion control algorithm and with various RTTs, so simply selecting an appropriate drop probability to achieve a TCP rate matching the egress link is a practical impossibility. Thus, the function of the fuzzy logic drop decision function may be to adjust the drop probability and monitor its effect on queuing latency with the goal of maintaining a busy egress link with the minimum amount of queuing latency. While it is conceivable for the network element to track the number of simultaneous TCP connections that it is supporting, it is much more difficult for it to estimate the RTT for each connection, or to determine which TCP implementation each is, or in which phase of the congestion control process each connection is. Thus, the ingress traffic rate (as driven by multiple sources that predominantly use TCP) may be modeled as a time-varying non-linear system that responds in a complex way that is generally inversely related to the packet drop probability.

FIG. 7 illustrates a flowchart 60 of a method for predictively managing a network buffer in accordance with one non-limiting aspect of the present invention. The method may be embodied in a non-transitory computer-readable medium having computer-readable instructions stored therein, operable with the processor, to facilitate the predictive managing contemplated herein. Block 62 relates to determining a sojourn time of a packet arriving at the network buffer. The sojourn time may be predicted on a per packet basis, i.e., when each packet arrives, to estimate the amount of time needed for the arriving packet to travel through a queue of the network buffer. Blocks 64 and 66 relate to executing a drop decision function, such as but not necessary limited to one of the drop decision functions described above, and as a function thereof determining whether the arriving packet should be dropped or not dropped before entering the queue. Block 68 relates to determining the arriving packet should be dropped and performing a related operation sufficient to prevent enqueuing the arriving packet. Block 70 to determining the arriving packet should not be dropped and performing an enqueuing operation sufficient to add the arriving packet to the queue. This process may be repeated as each packet arrives to provide per-packet prediction of sojourn time, per-packet drop decisions and/or multiple packet drop management (e.g., entering/exiting drop state).

One non-limiting aspect of the present invention allows the buffer to be sized to be large relative to the BDP, thus ensuring optimal TCP performance and the ability to handle traffic bursts, but eliminates the standing queue that is the side-effect of the loss-based TCP congestion control algorithm. This algorithm could be applicable to a wide range of network devices. It provides value for network devices that serve links that are typically bottlenecks, such as access network devices. As noted above, AQM may be used in the measurement of the per-packet queuing latency and the use of these measurements to produce a packet drop rate based upon a control law that takes as its input the sojourn time. As supported above, the fuzzy logic contemplated herein, which may be facilitated with the controller or a fuzzy logic controller, may offer an advantage over linear and state-space control algorithms in that the fuzzy logic does not require the controlled system be describable by a linear transfer function and/or as a transfer function. The fuzzy logic controller may be easily implemented and excel at dealing with systems that are complex, ill-defined or time-varying, such as the system described above.

While exemplary embodiments are described above, it is not intended that these embodiments describe all possible forms of the invention. Rather, the words used in the specification are words of description rather than limitation, and it is understood that various changes may be made without departing from the spirit and scope of the invention. Additionally, the features of various implementing embodiments may be combined to form further embodiments of the invention. 

What is claimed is:
 1. A method for predictively managing a network element configured for transmitting packets over a network, the network element including a buffer and a queue, a capacity of the buffer being split into at least a first portion and a second portion, the second portion being greater than the first portion and including an entirety of the queue, the queue being configured to enqueue packets at a queue input and to dequeue packets at a queue output, the packets traveling through the buffer in a first-in-first-out manner whereby the packets travel through the first portion and thereafter through the queue of the second portion from the queue input to the queue output, the method comprising: receiving a first packet at a buffer input of the buffer; predicting a first sojourn time prior to the first packet exiting the first portion, the first sojourn estimating time needed for the first packet to travel through the queue from the queue input to the queue output; determining whether to tail drop or not tail drop the first packet prior to being enqueued into the queue input based at least in part on the first sojourn time; dropping the first packet prior to reaching the queue input when the determination is to tail drop; and passing the first packet from the first portion to the queue input when the determination is to not tail drop.
 2. The method of claim 1 further comprising determining the first sojourn time as a ratio of a number of bytes in the queue relative to an egress rate of the network buffer, the number of bytes in the queue and the egress rate being determined proximate to or before receipt of the first packet at the buffer input, including determining to tail drop the first packet when the sojourn time is greater than a threshold and to not tail drop the first packet when the sojourn time is less than or equal to the threshold.
 3. The method of claim 2 further comprising determining the egress rate as a bit per second (bps) value representing a speed the network is able to dequeue packets from the queue output to the network.
 4. The method of claim 3 further comprising measuring the bps value prior to the first packet reaching the buffer input.
 5. The method of claim 3 further comprising estimating the bps value as a function of a plurality of egress rates measured prior to the first packet reaching the buffer input.
 6. The method of claim 1 further comprising determining to tail drop the first packet if the first sojourn time is greater than a sojourn threshold and to not tail drop the first packet if the first sojourn time is less than or equal to the sojourn threshold.
 7. The method of claim 1 further comprising: determining whether a drop state is one of active and inactive; if the drop state is active and the first sojourn time is greater than a sojourn threshold, determining to tail drop the first packet; if the drop state is inactive and the first sojourn time is greater than the sojourn threshold, determining to not tail drop the first packet.
 8. The method of claim 1 further comprising enqueuing the first packet into the queue input without adding a timestamp such that the first packet travels through the queue without addition of a time-based marking the determination is to not tail drop.
 9. The method of claim 1 further comprising determining whether to tail drop or not tail drop the first packet prior to being enqueued into the queue input without processing a timestamp and without measuring a first time that the first packet is within the first portion.
 10. The method of claim 9 further comprising: measuring a second time that the first packet is within the second portion when the decision is to not tail drop; determining whether to head drop or not head drop the first packet based on the second time; dropping the first packet after dequeuing from the queue output and prior to being transmitted over the network when the determination is to head drop; and transmitting the first packet from the network element to the network when the determination is to not head drop.
 11. A non-transitory computer-readable medium having instructions, operable with a processor, to facilitate predictively managing a network buffer, the network buffer having a queue configured to enqueue packets at an input and to dequeue packets at an output, the non-transitory computer-readable medium comprising instructions for: predicting sojourn time for each of a plurality of packets prior to being enqueued into the queue, the sojourn time predicting time needed for the corresponding packet to travel through the queue; and determining whether to tail drop or not tail drop a first packet of the plurality of packets prior to being enqueued into the queue based at least in part on the sojourn time predicted therefore; dropping the first packet prior to reaching the queue input when the determination is to tail drop; and passing the first packet to the queue input when the determination is to not tail drop.
 12. The non-transitory computer-readable medium of claim 11 further comprising instructions for determining the sojourn times as a ratio of a number of bytes in the queue relative to an egress rate proximate in time to receipt of each packet.
 13. The non-transitory computer-readable medium of claim 11 further comprising instructions for: determining whether to tail drop or not tail drop the first packet prior to being enqueued based on a comparison of the corresponding sojourn time to a sojourn threshold.
 14. The non-transitory computer-readable medium of claim 11 further comprising instructions for enqueuing the first packet when determined to be not tail drop without adding a timestamp such that the first packet travels through the queue without addition of a time-based marking.
 15. A network element comprising: a queue operable to queue a plurality of packets for subsequent transport over a link; and a controller having a non-transitory computer-readable medium and a processor for executing a plurality of instructions stored on the non-transitory computer-readable medium to manage packet drops on a per packet basis, the plurality of instructions including instructions for: i) determining a first packet of the plurality of packets received at the queue; ii) predicting a first sojourn time needed for the first packet to travel through the queue; iii) determining whether to tail drop or not tail drop the first packet prior to being enqueued into the queue input based at least in part on the first sojourn time; iv) dropping the first packet prior to reaching the queue when the determination is to tail drop; and v) passing the first packet to the queue input when the determination is to not tail drop.
 16. The network element of claim 15 wherein the plurality of instructions include instructions for determining to tail drop the first packet when the first sojourn time is above a sojourn threshold and determining to not tail drop the first packet when the first sojourn time equal to or less than the sojourn threshold.
 17. The network element of claim 16 wherein: the queue is included as part of a buffer, the buffer being a memory for temporarily storing the packets, wherein a first portion of a capacity of the buffer is allocated for storing packets prior to entry in to the queue and a second portion of the capacity is allocated to the queue; and the plurality of instructions includes instructions for enqueuing the first packet without adding a timestamp thereto and without associating a timestamp therewith such that the corresponding packet travels through the queue without addition of a time-based marking.
 18. The network element of claim 16 wherein the plurality of instructions includes instructions for: determining the first sojourn time as a ratio of a number of bytes in the queue relative to an egress rate of the link proximate in time to receipt of each packet. 